Conditional Confluence (System Description)
نویسندگان
چکیده
This paper describes the Conditional Confluence tool, a fully automatic confluence checker for first-order conditional term rewrite systems. The tool implements various confluence criteria that have been proposed in the literature. A simple technique is presented to test conditional critical pairs for infeasibility, which makes conditional confluence criteria more useful. Detailed experimental data is presented.
منابع مشابه
Confluence of Conditional Rewrite Systems
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the Church-Rosser, or confluence, property. In this paper, we settle negatively the question whether "joinabihty of critical pairs" is, ...
متن کاملConditional Rewrite Rules: Confluence and Termination
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. Here we consider rewrite rules with conditions, such as they arise, e.g., from algebraic specifications with positive conditional equations. The conditional term rewriting systems thus obtained which we will study, are based upon the well-known class of left-linear, nonambiguous TRSs. A large part o...
متن کاملOn Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation∗
This paper improves the existing criterion for proving confluence of a normal conditional term rewriting system (CTRS) via the Şerbănuţă-Roşu transformation, a computationally equivalent transformation of CTRSs into unconditional term rewriting systems (TRS), showing that a weakly left-linear normal CTRS is confluent if the transformed TRS is confluent. Then, we discuss usefulness of the optimi...
متن کاملSyntactic Confluence Criteria for Positive/Negative-Conditional Term Rewriting Systems
We study the combination of the following already known ideas for showing confluence of unconditional or conditional term rewriting systems into practically more useful confluence criteria for conditional systems: Our syntactic separation into constructor and non-constructor symbols, Huet’s introduction and Toyama’s generalization of parallel closedness for non-terminating unconditional systems...
متن کاملOn Termination and Confluence of Conditional Rewrite Systems
We consider the problem of verifying connuence and termination of conditional term rewriting systems. Recently we have obtained some interesting results for unconditional term rewriting systems (TRSs) which are non-overlapping or, more generally, locally connuent overlay systems. These results provide suucient criteria for termination plus connuence in terms of restricted termination and connue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014